BIP 83: Dynamic Hierarchical Deterministic Key Trees #242
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
CodeShark
force-pushed
the
DHD_key_trees
branch
16 times, most recently
from
8e6fd7c
to
65173db
Compare
luke-jr
changed the title
|
Needs Copyright section. |
luke-jr
changed the title
luke-jr
changed the title
CodeShark
force-pushed
the
DHD_key_trees
branch
from
65173db
to
fd6789c
Compare
|
@luke-jr copyright section added. |
luke-jr
added a commit
that referenced
this pull request
Jan 13, 2016
BIP 83: Dynamic Hierarchical Deterministic Key Trees
Wasstechn
approved these changes
Sep 22, 2021
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Proposed deterministic key tree structures suffer from the limitation that once a hierarchical level is used to derive signing keys, we can no longer nest deeper levels. This BIP proposes a solution to this problem.